منابع مشابه
Recursive reconstruction on periodic trees
A periodic tree Tn consists of full n-level copies of a finite tree T . The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1− . This model simulates noisy propagation of a bit from the root, and has significance both in communication theory and in biology. Our aim is to find an algorithm which decides ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملPeriodic gossiping on trees
In periodic gossip schemes, the calls are periodically repeated according to a proper coloring of the edges of the underlying graph with integers 1; 2;. .. ; c. One period consists of c consecutive rounds 1;. .. ; c each containing time-parallel bidirectional calls on all edges with the same color. The problem is to design colorings which minimize the number of periods until gossiping is comple...
متن کاملThe eccentric connectivity index of bucket recursive trees
If $G$ is a connected graph with vertex set $V$, then the eccentric connectivity index of $G$, $xi^c(G)$, is defined as $sum_{vin V(G)}deg(v)ecc(v)$ where $deg(v)$ is the degree of a vertex $v$ and $ecc(v)$ is its eccentricity. In this paper we show some convergence in probability and an asymptotic normality based on this index in random bucket recursive trees.
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1998
ISSN: 1042-9832,1098-2418
DOI: 10.1002/(sici)1098-2418(199808)13:1<81::aid-rsa5>3.3.co;2-k